package com.person.leetcode.editor.cn;

import java.util.Arrays;

/**
  * 719.找出第 K 小的数对距离
  * 2022-06-15 17:12:27
**/
public class Sequence_0719_FindKThSmallestPairDistance {
    public static void main(String[] args) {
        Solution solution = new Sequence_0719_FindKThSmallestPairDistance().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
        //数组内元素相减的绝对值 排序为k
    public int smallestDistancePair(int[] nums, int k) {
        Arrays.sort(nums);

        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}